Learning non-deterministic finite automata from queries and counterexamples
نویسنده
چکیده
In the recent theoretical research activity of inductive learning, in particular, of inductive inference, Angluin has introduced the model of learning called minimally adequate teacher (MAT), that is, the model of learning via membership queries and equivalence queries, and has shown that the class of regular languages is e ciently learnable using deterministic nite automata (DFAs) (Angluin 1987b). More speci cally, she has presented an algorithm which, given any regular language, learns from MAT a minimum DFA accepting the target in time polynomial in the number of states of the minimum DFA and the maximum length of any counterexample provided by the teacher.
منابع مشابه
Polynomial Time Learnability of Simple Deterministic Languages from MAT and a Representative Sample
We propose a learning algorithm for simple deterministic languages from queries and a priori knowledge. To the learner, a special finite subset of the target language, called a representative sample, is provided at the beginning and two types of queries, equivalence queries and membership queries, are available. This learning algorithm constructs nonterminals of a hypothesis grammar based on Is...
متن کاملAngluin-Style Learning of NFA
This paper introduces NL, a learning algorithm for inferring non-deterministic finite-state automata using membership and equivalence queries. More specifically, residual finite-state automata (RFSA) are learned similar as in Angluin’s popular L algorithm, which however learns deterministic finite-state automata (DFA). As RFSA can be exponentially more succinct than DFA, RFSA are the preferable...
متن کاملEs laden ein : Die Dozenten der Informatik Informatik - Oberseminar
Learning algorithms are increasingly used in multiple disciplines of today's computer science reaching from robotics and formal verification to bioinformatics or natural language recognition. In this talk, we consider learning algorithms in the context of software development and verification. Two novel variants of learning algorithms will be presented. In the first part, we introduce NL* an al...
متن کاملQuery Learning of Derived Omega-Tree Languages in Polynomial Time
We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of ω-tree languages derived from weak regular ω-word languages in polynomial time. The method is a general polynomial time reduction of learning a class of derived ω-tree languages to learning the underlyi...
متن کاملLearning k-edge Deterministic Finite Automata in the Framework of Active Learning
One of most attractive topics in grammatical inference is theoretically study on learnability of some classes of automata corresponding with defined formal languages. For last two decades a number of theoretical results have been reported and played as essential knowledge for applications in other fileds such as speech recognition and music-style recognition. In this paper, we consider the prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994